4C - Registration System - CodeForces Solution

data structures hashing implementation *1300

Please click on ads to support us..

Python Code: 

d={}
for _ in range(int(input())):
    s=input()
    if s in d:
        d[s]+=1 
        print(s+str(d[s]))
    else:
        d[s]=0
        print("OK")

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

map <string, int> m;

int n;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n;
    cin.ignore();
    for (int i = 1; i <= n; i++)
    {
        string s;
        cin >> s;
        if (m[s] == 0) cout << "OK" << "\n";
        else cout << s << m[s] << "\n";
        m[s]++;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1091A - New Year and the Christmas Ornament
1352B - Same Parity Summands
1102A - Integer Sequence Dividing
630B - Moore's Law
1004A - Sonya and Hotels
1680B - Robots
1690A - Print a Pedestal (Codeforces logo)
1295A - Display The Number
1077A - Frog Jumping
1714G - Path Prefixes
1369C - RationalLee
289B - Polo the Penguin and Matrix
1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft